Accelerating CUDA graph algorithms at maximum warp
نویسندگان
چکیده
منابع مشابه
Accelerating Large Graph Algorithms on the GPU Using CUDA
Graph algorithms are fundamental to many disciplines and application areas. Large graphs involving millions of vertices are common in scientific and engineering applications. Practical-time implementations using high-end computing resources have been reported but are accessible only to a few. Graphics Processing Units (GPUs) are fast emerging as inexpensive parallel processors due to their high...
متن کاملAccelerating GOR Algorithm Using CUDA
Protein secondary structure prediction is very important for its molecular structure. GOR algorithm is one of the most successful computational methods and has been widely used as an efficient analysis tool to predict secondary structure from protein sequence. However, the running time is unbearable with sharp growth in protein database. Fortunately, CUDA (Compute Unified Device Architecture) p...
متن کاملAccelerating Virtual Texturing Using CUDA
Virtual texturing is a promising technique to improve the visual quality of real-time rendering applications such as simulations and games. By selectively loading parts of the texture dataset, virtual texturing allows for higher resolution texturing than possible with traditional texturing techniques. However, virtual texturing also adds a significant overhead to the renderer. First, there is t...
متن کاملGraph Coloring using CUDA
ion of computation For a graph G = (V,E), we denote the number of vertices |V| by n, the number of edges|E| by m, and the degree of a vertex vi by deg(vi). The maximum, minimum, and average degree in a graph are denoted by (delta), (sigma), and (sigma -) respectively. The minimum number of colors required to color a graph is referred to as the Chromatic number. There exists several fast sequent...
متن کاملAccelerating Algorithms using a Dataflow Graph in a Reconfigurable System
In this paper, the acceleration of algorithms using a design of a field programmable gate array (FPGA) as a prototype of a static dataflow architecture is discussed. The static dataflow architecture using operators interconnected by parallel buses was implemented. Accelerating algorithms using a dataflow graph in a reconfigurable system shows the potential for high computation rates. The result...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2011
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2038037.1941590